Online MPL Scheduling of Backward Type for Repetitive Systems with MIMO-FIFO Structure

This paper proposes an online scheduling method considering no-concurrency of resource with subsequent event. We focus on repetitive discrete event systems with MIMO (Multiple Inputs and Multiple Outputs)-FIFO structure. The behavior of such kind of systems can be described by linear equations in max-plus algebra, which is also called the MPL (Max-Plus Linear) systems. Conventional MPL representation formulates no-concurrency of resource with previous event and can provide the earliest starting times in internal facilities. We recently proposed a calculation method for a single job, however, the resource no-concurrency with the subsequent job is not considered. Thus, it may not give an optimal solution if a large number of jobs have to be handled. Therefore, we derive a general form of MPL representation that provides the latest starting times considering the no-concurrency with subsequent event. Also, we consider an effective rescheduling method which is applicable for cases where the system parameters are changed after the job commencement. Key-Words: Max-plus linear system, repetitive system, state-space representation, MIMO, earliest/latest time, rescheduling, forward/backward type